package Lee_code;

import java.util.Arrays;

public class Lee_416
{
    public boolean canPartition(int[] nums)
    {
        int sum = 0, target = 0;
        for(int i: nums)
        {
            sum = sum + i;
        }
        if(sum % 2 == 0)
        {
            target = sum/2;
        }
        else
        {
            return false;
        }


        return true;
    }
}
